Complex orthogonal designs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amicable complex orthogonal designs

In this letter, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACOD’s from lower-order ACOD’s. Although the upper bound on the number of variables of ACOD’s is found to be the same as that of amicable orthogonal designs (AOD), we show that certain types of AOD’s that were previously shown to be non-existent or undecided, such as...

متن کامل

Complex Orthogonal Designs

For p×n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate k p of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the r...

متن کامل

Quaternion orthogonal designs from complex companion designs

The success of applying generalized complex orthogonal designs as space–time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space–timepolarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build ...

متن کامل

Complex Orthogonal Designs with Forbidden 2 × 2 Submatrices

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz an M-type COD if and only if Oz does not contain submatrix (

متن کامل

On the nonexistence of rate-one generalized complex orthogonal designs

Orthogonal space–time block coding proposed recently by Alamouti [1] and Tarokh, Jafarkhani, and Calderbank [4] is a promising scheme for information transmission over Rayleigh-fading channels using multiple transmit antennas due to its favorable characteristics of having full transmit diversity and a decoupled maximum-likelihood (ML) decoding algorithm. Tarokh, Jafarkhani, and Calderbank exten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1978

ISSN: 0097-3165

DOI: 10.1016/0097-3165(78)90014-6